Exact intersection of 3D geometric models
نویسندگان
چکیده
This paper presents 3D-EPUG-OVERLAY, an exact and parallel algorithm for computing the intersection of 3D triangulated meshes, a problem with applications in several fields such as GIS and CAD. 3D-EPUG-OVERLAY presents several innovations: it employs exact arithmetic and, thus, the computations are completely exact, which avoids topological impossibilities that are often created by floating point arithmetic. Also, it uses a uniform grid to index the geometric data and was designed to be easily parallelizable. Furthermore, we propose the use of Simulation of Simplicity to effectively ensure that all the special cases are properly handled by the algorithm.
منابع مشابه
Target detection Bridge Modelling using Point Cloud Segmentation Obtained from Photogrameric UAV
In recent years, great efforts have been made to generate 3D models of urban structures in photogrammetry and remote sensing. 3D reconstruction of the bridge, as one of the most important urban structures in transportation systems, has been neglected because of its geometric and structural complexity. Due to the UAV technology development in spatial data acquisition, in this study, the point cl...
متن کاملA Hybrid 3D Colon Segmentation Method Using Modified Geometric Deformable Models
Introduction: Nowadays virtual colonoscopy has become a reliable and efficient method of detecting primary stages of colon cancer such as polyp detection. One of the most important and crucial stages of virtual colonoscopy is colon segmentation because an incorrect segmentation may lead to a misdiagnosis. Materials and Methods: In this work, a hybrid method based on Geometric Deformable Models...
متن کاملA Generic Design for Implementing Intersection Between Triangles in Computer Vision and Spatial Reasoning
The intersection between 3D objects plays a prominent role in spatial reasoning, and computer vision. Detection of intersection between objects can be based on the triangulated boundaries of the objects, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross and coplanar intersection. For qualitative reasoning, intersection detection is suffic...
متن کاملRandom intersection graphs and their applications in security, wireless communication, and social networks
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assi...
متن کاملA modeling methodology for finite element mesh generation of multi-region models with parametric surfaces
This paper presents a description of the reorganization of a geometric modeler, MG, designed to support new capabilities of a topological module (CGC) that allows the detection of closed-off solid regions described by surface patches in non-manifold geometric models defined by NURBS. These patches are interactively created by the user by means of the modeler’s graphics interface, and may result...
متن کامل